Brief Announcement: Papillon: Greedy Routing in Rings

نویسندگان

  • Ittai Abraham
  • Dahlia Malkhi
  • Gurmeet Singh Manku
چکیده

We construct the first n-node degree-d ring-based network with worst-case greedy routes of length Θ(log n/ log d) hops. We study greedy routing over uni-dimensional metrics defined over n nodes lying in a ring. greedy routing in graph (V, E) with distance function δ : V × V → R entails the following decision: Given target node t, node u with neighbors N(u) forwards a message to v ∈ N(u) such that δ(v, t) = minx∈N(u) δ(x, t). The distance metric we use over n nodes placed in a circle is the clockwise-distance between pairs of nodes (the full paper contains a similar study of the absolute-distance metric): δclock(u, v) = v − u if v ≥ u, n + v − u otherwise. Let ∆clock denote the worst-case greedy route length with δclock. ∆clock denotes the average greedy route length over all-pairs. Summary of results. We construct a family of network topologies, the Papillon , in which greedy routes are asymptotically optimal. Papillon has greedy routes of length ∆clock = Θ(log n/ log d) hops in the worst-case when each node has d out-going links. Papillon is the first construction that achieves asymptotically optimal worst-case greedy routes. Upon further investigation, two properties of Papillon emerge: (a) greedy routing does not send messages along shortest paths, and (b) Edge congestion with greedy routing is not uniform – some edges are used more often than others. We exhibit the first property by identifying routing strategies that result in paths shorter than those achieved by greedy routing. In fact, one of these strategies guarantees uniform edge-congestion. The Papillon network. The intuitive idea of the Papillon construction is as follows. Nodes are arranged in m levels, where n = κm. A node at level i has links to nodes one level down (wrapping at zero). Level-i links cover nodes between 4 The principles of this work can be extended to higher dimensional spaces. We focus on one-dimension for simplicity. 5 Our constructions are variants of the well-known butterfly family, hence the name Papillon.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Papillon: Greedy Routing in Rings

We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such graphs arise in the context of modeling social networks and in routing networks for peer-to-peer systems. We construct the first network over n nodes in which greedy routing takes O(log n/ log d) hops in the worst-case,...

متن کامل

Brief Announcement: Incentive-Compatible Distributed Greedy Protocols

Under many distributed protocols, the prescribed behavior for participants is to behave greedily, i.e., to repeatedly“best respond” to the others’ actions. We present recent work (Proc. ICS’11 ) where we tackle the following general question: “When is it best for a long-sighted participant to adhere to a distributed greedy protocol?”. We take a game-theoretic approach and exhibit a class of gam...

متن کامل

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands

Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...

متن کامل

Packet Routing and Information Gathering in Lines, Rings and Trees

We study the problem of online packet routing and information gathering in lines, rings and trees. A network consists of n nodes. At each node there is a buffer of size B. Each buffer can transmit one packet to the next buffer at each time step. The packets injection is under adversarial control. Packets arriving at a full buffer must be discarded. In information gathering all packets have the ...

متن کامل

Periodically Regular Chordal Rings

ÐChordal rings have been proposed in the past as networks that combine the simple routing framework of rings with the lower diameter, wider bisection, and higher resilience of other architectures. Virtually all proposed chordal ring networks are nodesymmetric, i.e., all nodes have the same in/out degree and interconnection pattern. Unfortunately, such regular chordal rings are not scalable. In ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005